Time-Space Trade-offs for Triangulating a Simple Polygon
نویسندگان
چکیده
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We present a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices that runs in O(n/s+ n logn log(n/s)) expected time using O(s) variables, for any s ≤ n. In particular, when s ≤ n logn log5 logn the algorithm runs in O(n/s) expected time.
منابع مشابه
Time-Space Trade-off Algorithms for Triangulating a Simple Polygon∗
An s-workspace algorithm is an algorithm that has read-only access to the values of the input, write-only access to the output, and only uses O(s) additional words of space. We present a randomized s-workspace algorithm for triangulating a simple polygon P of n vertices that runs in O(n/s+ n logn log(n/s)) expected time using O(s) variables, for any s ≤ n. In particular, when s ≤ n logn log5 lo...
متن کاملEthical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage
This article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (UHC). Since the fiscal space is constrained, trade-offs need to be made. But some trade-offs are unacceptable on the path to universal coverage. Unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...
متن کاملA New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms
We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only O(s) words of workspace in addition to the memory for input. In this paper, we present an O(n/s)-time s-workspace algorithm for subdividing a simple polygon into O(min{n/s, s}) subpolygons of complexity O(max{n/s, s}). As applicati...
متن کاملTriangulating a Simple Polygon in Linear Time
Triangulating a simple polygon has been one of the most outstanding open problems in two-dimensional computational geometry. It is a basic primitive in computer graphics and, generally, seems the natural preprocessing step for most nontrivial operations on simple polygons [5,13]. Recall that to triangulate a polygon is t o partition it into triangles without adding any new vertices. Despite its...
متن کاملTriangulating Simple Polygons: Pseudo-Triangulations
Triangulating a given n-vertex simple polygon means to partition the interior of the polygon into n − 2 triangles by adding n − 3 nonintersecting diagonals. Significant theoretical advances have recently been made in finding efficient polygon triangulation algorithms. However, there is substantial effort being made in finding a simple and practical triangulation algorithm. We propose the concep...
متن کامل